منابع مشابه
Counting subset sums of finite abelian groups
In this paper, we obtain an explicit formula for the number of zero-sum k-element subsets in any finite abelian group.
متن کاملSubset Sums
IAl > ((l/k) + E)n then there is a subset B L A such that 0 < 1 BI 0, let snd(nt) denote the smallest integer that does not divide PI. We prove that for every I-: > 0 there is a constant c = ~(8:) z I, such that for every n > 0 and every rn, n ' +' 6 WI < n'llog'n...
متن کاملSUBSET SUMS IN Zp
Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?
متن کاملVote trading and subset sums
We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied vote-swapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete.
متن کاملSubset Sums modulo a Prime
Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Ramanujan Journal
سال: 2018
ISSN: 1382-4090,1572-9303
DOI: 10.1007/s11139-018-0020-0